Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Isomorphism")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 2702

  • Page / 109
Export

Selection :

  • and

Testing homotopy equivalence is isomorphism completeZALCSTEIN, Y; FRANKLIN, S. P.Discrete applied mathematics. 1986, Vol 13, Num 1, pp 101-104, issn 0166-218XArticle

Cayley graphs of finitely generated groupsTHOMAS, Simon.Proceedings of the American Mathematical Society. 2006, Vol 134, Num 1, pp 289-294, issn 0002-9939, 6 p.Article

METRISATION D'UNE CLASSE DE GRAPHESMETEL'SKIJ NN; KORNIENKO NM.1979; DOKL. AKAD. NAUK B.S.S.R.; SUN; DA. 1979; VOL. 23; NO 1; PP. 5-7; ABS. ENG; BIBL. 3 REF.Article

L'isomorphisme de Jones-McCleary et celui de Goodwillie sont des isomorphismes d'algèbres = Both Jones-McCleary and Goodwillie isomorphisms are algebras isomorphismsIDRISSI, Elhassan.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 2000, Vol 331, Num 7, pp 507-510, issn 0764-4442Article

Application of edge permutation group to structural synthesis of epicyclic gear trainsJAE UK KIM; BYUNG MAN KWAK.Mechanism and machine theory. 1990, Vol 25, Num 5, pp 563-574, issn 0094-114X, 12 p.Article

La demi-reconstructibilité des relations binaires d'au moins 13 éléments = Half-reconstructibility of binary relations of cardinality at least 13HAGENDORF, J. G; LOPEZ, G.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1993, Vol 317, Num 1, pp 7-12, issn 0764-4442Article

On the cycle-isomorphism of graphsXINGXING YU.Journal of graph theory. 1991, Vol 15, Num 1, pp 19-27, issn 0364-9024Article

Graph isomorphism and theorems of Birkhoff typeTINHOFER, G.Computing (Wien. Print). 1986, Vol 36, Num 4, pp 285-300, issn 0010-485XArticle

INVARIANTS DES GRAPHES PERMETTANT DE DETERMINER LEUR ISOMORPHISMELYUBCHENKO GG; PODLIPENSKIJ VS.1979; AVTOMATIKA; UKR; DA. 1979; NO 6; PP. 36-41; ABS. ENG; BIBL. 6 REF.Article

TOPOLOGISCHE SCHALTUNGSKONTROLLE VON IC-LAYOUTS = CONTROLE TOPOLOGIQUE DES CONFIGURATIONS DE CIRCUITS INTEGRESJAEGER U; KLEINDIENST I.1978; NACHR.-TECH. Z.; DEU; DA. 1978; VOL. 31; NO 12; PP. 904-905; ABS. ENG; BIBL. 9 REF.Article

Multiplicative *-Lie isomorphisms between factorsZHAOFANG BAI; SHUANPING DU.Journal of mathematical analysis and applications. 2008, Vol 346, Num 1, pp 327-335, issn 0022-247X, 9 p.Article

CAUSES OF LIMITED ISOMORPHISM.SHCHERBINA VV.1969; GEOCHEMISTRY INTERN., U.S.A., TRAD. DE GEOKHIMIJA, S.S.S.R.; 1969, VOL. 6, NUM. 0006, P. 1013 A 1015Miscellaneous

PROPRIETES DES ESPACES METRIQUES DE CLASSES D'ISOMORPHISME DE GRAPHESKORNIENKO NM.1981; VESCI AKAD. NAVUK BSSR, SER. FIZ.-MAT. NAVUK; ISSN 0002-3574; BYS; DA. 1981; NO 2; PP. 32-36; ABS. ENG; BIBL. 6 REF.Article

Cataloguing the graphs on 10 verticesCAMERON, R. D; COLBOURN, C. J; READ, R. C et al.Journal of graph theory. 1985, Vol 9, Num 4, pp 551-562, issn 0364-9024Article

Randomly decomposable graphsRUIZ, S.Discrete mathematics. 1985, Vol 57, Num 1-2, pp 123-128, issn 0012-365XArticle

WEAK EHRENFEUCHT-FRAÏSSÉ GAMESHYTTINEN, Tapani; KULIKOV, Vadim.Transactions of the American Mathematical Society. 2011, Vol 363, Num 6, pp 3309-3334, issn 0002-9947, 26 p.Article

Biological network motif detection: principles and practiceWONG, Elisabeth; BAUR, Brittany; QUADER, Saad et al.Briefings in bioinformatics. 2012, Vol 13, Num 2, pp 202-215, issn 1467-5463, 14 p.Article

ON THE NUMBER OF UNIVERSAL SOFIC GROUPSTHOMAS, Simon.Proceedings of the American Mathematical Society. 2010, Vol 138, Num 7, pp 2585-2590, issn 0002-9939, 6 p.Article

Bases in semilinear spaces over zerosumfree semiringsSHU, Qian-Yu; WANG, Xue-Ping.Linear algebra and its applications. 2011, Vol 435, Num 11, pp 2681-2692, issn 0024-3795, 12 p.Article

Characterization of the cartesian product of complete graphs by convex subgraphsEGAWA, Y.Discrete mathematics. 1986, Vol 58, Num 3, pp 307-309, issn 0012-365XArticle

Some remarks on universal graphsDIESTEL, R; HALIN, R; VOGLER, W et al.Combinatorica (Print). 1985, Vol 5, Num 4, pp 283-293, issn 0209-9683Article

Planarity testing of graphs on base of a spring modelHOTZ, Günter; LOHSE, Steffen.Lecture notes in computer science. 2002, pp 471-472, issn 0302-9743, isbn 3-540-43309-0Conference Paper

A semi-strong perfect graph theoremREED, B.Journal of combinatorial theory. Series B. 1987, Vol 43, Num 2, pp 223-240, issn 0095-8956Article

Stability, domination and irredundance in a graphFAVARON, O.Journal of graph theory. 1986, Vol 10, Num 4, pp 429-438, issn 0364-9024Article

On local right pure semisimple rings of length two or threeSIMSON, Daniel.Osaka Journal of Mathematics. 2002, Vol 39, Num 4, pp 985-1003, issn 0030-6126, 19 p.Article

  • Page / 109